A:Realizer, i, x:Id, T:Type, v:(T + (T)).
R-Feasible(A)  ((x  dom(R-state(A;i))))  Rinit(i;T;x;v) || A 

latex

Definitions

Rinit-v(x1), Reffect-f(x1), Rinit-discrete(A), Rinit-x(x1), Rinit?(x1), Reffect-discrete(A), SQType(T), P  Q, Rsends-T(x1), Reffect-T(x1), Rsends-dt(x1), Rpre-a(x1), Rpre-ds(x1), Rpre?(x1), Rsends-ds(x1), Rbframe-L(x1), Rbframe-k(x1), Rbframe?(x1), Rsframe-L(x1), Rsends-knd(x1), Rsends-g(x1), Rsframe-tag(x1), Rsends-l(x1), Rsframe-lnk(x1), Rsframe?(x1), Rsends?(x1), Rrframe-L(x1), Reffect-ds(x1), Rrframe-x(x1), Rrframe?(x1), Raframe-L(x1), Raframe-k(x1), Raframe?(x1), Rframe-L(x1), Reffect-knd(x1), Reffect-x(x1), Rframe-x(x1), Rframe?(x1), Reffect?(x1), tt, t.2, (i = j), p  q, R-interface-compat(A;B), R-discrete_compat(A;B), R-frame-compat(A;B), R-base-domain(R), p = q, Rda(R), Rds(R), R-loc(R), Rnone?(x1), Rplus-right(x1), Rplus-left(x1), P & Q, Rplus?(x1), True, Y, ff, p q, t.1, if b then t else f fi , Top, t  T, x. t(x), {T}, , A || B, R-state(R;i), A, P  Q, x:A. B(x), Unit, P  Q, P  Q, False, reduce(f;k;as), deq-member(eq;x;L), , , x(s), x  dom(f), b,

Lemmas

Rrframe wf, Rbframe wf, Raframe wf, finite-prob-space wf, Rpre wf, locl wf, Rsends wf, lnk-decl wf, fpf-join wf, decl-type wf, decl-state wf, Reffect wf, R-Feasible-effect, fpf-empty-compatible-left, fpf-compatible-single2, IdLnk wf, Rsframe wf, lsrc wf, Knd wf, Rframe wf, assert of bnot, eqff to assert, bnot wf, fpf-empty wf, Kind-deq wf, fpf-empty-compatible-right, fpf-compatible-singles, fpf-single-dom, fpf-single wf, not functionality wrt iff, assert-eq-id, eqtt to assert, iff transitivity, bool wf, bool sq, eq id wf, bool cases, Rplus wf, fpf-join-dom, R-Feasible-Rplus, R-compat-Rplus2, Rnone wf, es realizer wf, Rinit wf, R-compat wf, top wf, fpf wf, fpf-trivial-subtype-top, R-state wf, id-deq wf, fpf-dom wf, assert wf, not wf, R-Feasible wf, rationals wf, Id wf, es realizer-induction